Lazy Knowledge Base Update
نویسندگان
چکیده
Knowledge base update has been given much attention in the AI literature. The best-known solution to this problem is Winslett's PMA formalism. In this paper we propose di erent intuitions standing behind knowledge base update. Roughly speaking, we consider an update formula not as an e ect of an action to be performed, but rather as an observation about dynamically changing world made by an agent. This observation, if it is consistent with the knowledge base, is assumed to be just a new piece of information about the world. Otherwise, it is assumed that a single action has been performed and is its, usually partial, e ect. We formalize our approach using Dijkstra's semantics. We also examine the properties of our update operator with respect to Katsuno and Mendelzon's postulates.
منابع مشابه
Reducing computation by unifying inference with user interface
User interfaces are becoming an integral component of usable interactive artificial intelligence systems. A high-bandwidth graphical interface between the user and the computer's representation of knowledge greatly facilitates intelligent human/computer interaction. When user input or inference modifies knowledge base assertions, computationally expensive cascaded updates often propagate throug...
متن کاملIterated Revision in the Spirit of Update: A Lazy Update
Since they were introduced, AGM revision and Katsuno and Mendelzon's update have been considered orthogonal theory change operations serving diierent purposes. This work provides a new presentation of AGM revision based on the update semantic apparatus establishing in such a way a bridge between the two seemingly incomparable frameworks. We deene a new operation as a variant of the standard upd...
متن کاملDesigning Distributed Search Structures with Lazy Updates
Very large database systems require distributed storage for expansibility and high throughput, which means that they need distributed search structures for fast and eecient access to the data. In a highly parallel distributed search structure, parts of the index must be replicated to avoid serialization bottlenecks. Designing distributed and replicated search structures is made diicult by the c...
متن کاملReasoning about Agent’s Private Knowledge
An important property of an autonomous agent is its ability to reason about other agents’ private knowledge. Knowledge about the community and private knowledge of its members can be obtained by monitoring events appearing in the community. We propose three approaches how an agent can use the observed events to build such a model: one is based on theorem proving, the other on machine learning t...
متن کاملALGORITHM INVENTION AND VERIFICATION BY LAZY THINKING Presented at the 5 International Workshop on Symbolic and Numeric Algorithms for Scientific Computation
In this paper, we study algorithm invention and verification as a specific variant of systematic theory exploration and propose the ”lazy thinking paradigm” for inventing and verifying algorithms automatically; i.e., for a given predicate logic specification of the problem in terms of a set of operations (functions and predicates), the method produces an algorithm that solves the problem togeth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001